Fast Robust BSP Tree Traversal Algorithm for Ray Tracing
نویسندگان
چکیده
منابع مشابه
Fast Robust BSP Tree Traversal Algorithm for Ray Tracing
An orthogonal BSP (binary space partitioning) tree is a commonly used spatial subdivision data structure for ray tracing acceleration. While the construction of a BSP tree takes a relatively short time, the e ciency of a traversal algorithm signi cantly in uences the overall rendering time. We propose a new fast traversal algorithm based on statistical evaluation of all possible cases occurring...
متن کاملA Vectorized Traversal Algorithm for Ray Tracing
This article presents an optimized ray tracing algorithm which improves standard existing algorithms by processing simultaneously a large set of rays and carrying out a single traversal of the spatial indexing of the scene with all rays. This allows hardware SIMD functionality to be used efficiently and produces coherent memory accesses. Furthermore, during the single traversal, rays are groupe...
متن کاملStackless KD-Tree Traversal for High Performance GPU Ray Tracing
Significant advances have been achieved for realtime ray tracing recently, but realtime performance for complex scenes still requires large computational resources not yet available from the CPUs in standard PCs. Incidentally, most of these PCs also contain modern GPUs that do offer much larger raw compute power. However, limitations in the programming and memory model have so far kept the perf...
متن کاملReview: Kd-tree Traversal Algorithms for Ray Tracing
In this paper we review the traversal algorithms for kd-trees for ray tracing. Ordinary traversal algorithms such as sequential, recursive, and those with neighbor-links have different limitations, which led to several new developments within the last decade. We describe algorithms exploiting ray coherence and algorithms designed with specific hardware architecture limitations such as memory la...
متن کاملTraversal methods for GPU ray tracing
Ways of exploiting the raw performance of GPUs for computing ray tracing have been a hot research topic recently. Performance similar to the multi-core CPU ray tracing engines has been achieved. In this paper we present a new traversal method created by combining two of the existing methods. The proposed method is less sensitive to performance loss due to certain object scene distribution. It c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graphics Tools
سال: 1997
ISSN: 1086-7651
DOI: 10.1080/10867651.1997.10487481